Layout Optimization of a Three Dimensional Order Picking Warehouse

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Simulation and Optimization of a Pull-Strategy in the Order-Picking Area of a Distribution Warehouse

In this paper, an approach using simulation and optimization to maximize the throughput of an order-picking area is presented. The retrieval of pallets from a high-bay warehouse to the picking stations is formulated as an assignment problem and solved. To consider the dynamic e ects of the materials handling system (con icts, blocking), the optimal static assignment is validated with simulation...

متن کامل

Integrated Order Batching and Distribution Scheduling in a Single-block Order Picking Warehouse Considering S-Shape Routing Policy

In this paper, a mixed-integer linear programming model is proposed to integrate batch picking and distribution scheduling problems in order to optimize them simultaneously in an order picking warehouse. A tow-phase heuristic algorithm is presented to solve it in reasonable time. The first phase uses a genetic algorithm to evaluate and select permutations of the given set of customers. The seco...

متن کامل

A U-shaped layout for manual order-picking systems

In manual order picking systems, order pickers walk or ride through a warehouse in order to collect items requested by customers. The performance of such a system is significantly dependent on its layout which determines the lengths of the order pickers’ tours and the corresponding picking times. Whereas for classic warehouse layouts all picking aisles are arranged in parallel to each other, in...

متن کامل

Order picking in an automatic warehouse: Solving online asymmetric TSPs

We report on a joint project with industry that had the aim to sequence transportation requests within an automatic storage system in such a way that the overall travel time is minimized. The manufacturing environment is such that scheduling decisions have to be made before all jobs are known. We have modeled this task as an online Asymmetric Traveling Salesman Problem (ATSP). Several heuristic...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: IFAC-PapersOnLine

سال: 2015

ISSN: 2405-8963

DOI: 10.1016/j.ifacol.2015.06.240